海上多角反射体群雷达散射面积的快速预估算法

依据远场高频环境下雷达散射面积(RCS)的计算原理,对海上多个角反射体所组成的无源对抗系统的RCS特性进行预估计算。针对传统算法计算量过大的问题,借助Hepermesh有限元网格处理软件,提出了一种快速算法,该算法首先应用混合面元、快速投影理论实现海上单个角反射体RCS计算,然后结合散射中心合成算法对海面随机布放多角反射体群的整体RCS特性进行预估,随后利用FEKO软件对算法进行了仿真验证。结果表明:新算法能够在保持计算精度的前提下,有效缩短海上多角反射体群RCS的计算时间。     

低轨预警自由段弹道估计的多项式逼近算法

低轨单星对自由段弹道的估计是天基预警系统需解决的关键技术之一.建立了低轨预警卫星对自由段弹道的观测模型,针对极大似然估计批处理算法的大运算量问题,给出了一种多项式逼近算法,由观测数据的逼近多项式在一些特定采样点的值形成伪观测数据,以伪观测数据代替原观测数据进行弹道估计.仿真表明,精度与极大似然估计相当,运算量显著降低.     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

基于小波去噪半参数回归模型的卫星轨道测量数据预处理方法

由于卫星轨道测量数据中含有非线性误差,使用传统的最小二乘多项式拟合方法对其进行预处理必然会降低定轨精度.在半参数回归模型的基础上,应用小波阈值去噪算法估计并消除观测数据中存在的非线性误差,提出了基于小波去噪半参数回归模型的卫星轨道测量数据预处理方法,以提高数据预处理的精度.对某卫星USB跟踪数据应用该方法进行了仿真,仿真结果表明:该方法可以分离出观测数据中的白噪声和非线性误差,从而可以在观测数据中消除非线性误差的影响,提高数据预处理的精度.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

一种基于导航点的航天器相对运动轨迹生成策略

针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性.     

北斗RDSS系统新体制信号子载波间干扰产生机理与消除方法

为提高新一代北斗无线电测定卫星服务在有限带宽内的信息服务容量，借鉴了正交频分复用的理念，新体制无线电测定卫星服务信号设计采用多个子载波进行信号调制。以往针对多用户的分析主要考虑多址干扰，对载波频偏损耗和伪码损耗单独考虑，这不能解释新体制调制在相同的同步头的情况下其他子载波上信号在当前观测子载波上形成较大相关峰的问题，该问题对信号接收产生较大干扰。本文对该问题产生机理进行了分析，并提出了两种相关干扰的消除方法。     

Level workforce planning for multistage transfer lines

In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016     

非磁化等离子体与电磁波的作用

为了将等离子体RCS减缩技术应用于飞行器上,首先从微观角度分析等离子体与电磁波的作用;然后通过计算机仿真技术,分析了等离子体对电磁波的吸收、反射性能;最后探讨了几种解决等离子体电磁兼容问题的方法。结果表明等离子体对电磁波有一定的吸收效果,并可通过控制覆盖在飞行器表面等离子体的形状改变飞行器的电磁外形。等离子体RCS减缩技术具有潜在的工程应用价值。     

Scheduling with variable time slot costs

In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010